A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank
نویسندگان
چکیده
منابع مشابه
A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank
We give an improved local partitioning algorithm using heat kernel pagerank, a modified version of PageRank. For a subset S with Cheeger ratio (or conductance) h, we show that there are at least a quarter of the vertices in S that can serve as seeds for heat kernel pagerank which lead to local cuts with Cheeger ratio at most O( √ h), improving the previously bound by a factor of p log |S|.
متن کاملComputing Heat Kernel Pagerank and a Local Clustering Algorithm
Heat kernel pagerank is a variation of Personalized PageRank given in an exponential formulation. In this work, we present a sublinear time algorithm for approximating the heat kernel pagerank of a graph. The algorithm works by simulating random walks of bounded length and runs in time O( log( ) logn 3 log log( 1) ), assuming performing a random walk step and sampling from a distribution with b...
متن کاملGraph partitioning and a componentwise PageRank algorithm
In this article we will present a graph partitioning algorithm which partitions a graph into two different types of components: the well-known ‘strongly connected components’ as well as another type of components we call ‘connected acyclic component’. We will give an algorithm based on Tarjan’s algorithm for finding strongly connected components used to find such a partitioning. We will also sh...
متن کاملDistributed Algorithms for Finding Local Clusters Using Heat Kernel Pagerank
A distributed algorithm performs local computations on pieces of input and communicates the results through given communication links. When processing a massive graph in a distributed algorithm, local outputs must be configured as a solution to a graph problem without shared memory and with few rounds of communication. In this paper we consider the problem of computing a local cluster in a mass...
متن کاملThe heat kernel as the pagerank of a graph
The concept of pagerank was first started as a way for determining the ranking of Webpages by Web search engines. Based on relations in interconnected networks, pagerank has become a major tool for addressing fundamental problems arising in general graphs, especially for large information networks with hundreds of thousands of nodes. A notable notion of pagerank, introduced by Brin and Page and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Mathematics
سال: 2009
ISSN: 1542-7951,1944-9488
DOI: 10.1080/15427951.2009.10390643